A new exact penalty method for semi-infinite programming problems
نویسندگان
چکیده
منابع مشابه
An exact penalty function for semi-infinite programming
This paper introduces a global approach to the semi-infinite programming problem that is based upon a generalisation of the g~ exact penalty function. The advantages are that the ensuing penalty function is exact and the penalties include all violations. The merit function requires integrals for the penalties, which provides a consistent model for the algorithm. The discretization is a result o...
متن کاملA New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, which only keeps those active constraints with positive Lagrange multipliers. Moreover, we exploit the idea of looking for η-infeasible indices of the lower level problem as the adding-rule in our algorithm. Hence the a...
متن کاملOptimality Conditions for Semi-infinite and Generalized Semi-infinite Programs via lp Exact Penalty Functions
In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملPenalty and Smoothing Methods for Convex Semi-Infinite Programming
In this paper we consider min-max convex semi-infinite programming. In order to solve these problems we introduce a unified framework concerning Remez-type algorithms and integral methods coupled with penalty and smoothing methods. This framework subsumes well-known classical algorithms, but also provides some new methods with interesting properties. Convergence of the primal and dual sequences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2014
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.11.010